package leetcode.easy;

import leetcode.base.TreeNode;

/**
 * ClassName: $617_MergeTrees
 * Description:
 * date: 2022-02-19 12:12
 *
 * @author liyifan
 */
public class $617_MergeTrees {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if (root1 == null) return root2;
        if (root2 == null) return root1;

        TreeNode merge = new TreeNode(root1.val + root2.val);
        merge.left = mergeTrees(root1.left, root2.left);
        merge.right = mergeTrees(root1.right, root2.right);
        return merge;
    }
}
